Burgess bounds for short mixed character sums
نویسندگان
چکیده
This paper proves nontrivial bounds for short mixed character sums by introducing estimates for Vinogradov’s mean value theorem into a version of the Burgess method.
منابع مشابه
Character sums with Beatty sequences on Burgess-type intervals
We estimate multiplicative character sums taken on the values of a non-homogeneous Beatty sequence {⌊αn + β⌋ : n = 1, 2, . . . }, where α, β ∈ R, and α is irrational. Our bounds are nontrivial over the same short intervals for which the classical character sum estimates of Burgess have been established. 2000 Mathematics Subject Classification: 11B50, 11L40, 11T24
متن کاملSum-Product and Character Sums in finite fields
In this talk I will present estimates on incomplete character sums in finite fields, with special emphasize on the non-prime case. Some of the results are of the same strength as Burgess celebrated theorem for prime fields. The improvements are mainly based on arguments from arithmetic combinatorics providing new bounds on multiplicative energy and an improved amplification strategy. In particu...
متن کاملA Survey on Pure and Mixed Exponential Sums modulo Prime Powers
where p is a prime power, epm(·) is the additive character epm(x) = e m and χ is a multiplicative character (mod p). The goals of this paper are threefold; first, to point out the similarity between exponential sums over finite fields and exponential sums over residue class rings (mod p) with m ≥ 2; second, to show how mixed exponential sums can be reduced to pure exponential sums when m ≥ 2 an...
متن کاملOn Character Sums of Binary Quadratic Forms
We establish character sum bounds of the form ∣∣∣∣ ∑ a≤x≤a+H b≤y≤b+H χ(x + ky) ∣∣∣∣ < p−τH2, where χ is a nontrivial character (mod p), p 1 4 +ε < H < p, and |a|, |b| < p H. As an application, we obtain that given k ∈ Z\{0}, x + k is a quadratic non-residue (mod p) for some 1 ≤ x < p 1 2e. Introduction. Let k be a nonzero integer. Let p be a large prime and let H ≤ p. We are interested in the c...
متن کاملQuadratic class numbers and character sums
We present an algorithm for computing the class number of the quadratic number field of discriminant d. The algorithm terminates unconditionally with the correct answer and, under the GRH, executes in Oε(|d|) steps. The technique used combines algebraic methods with Burgess’ theorem on character sums to estimate L(1, χd). We give an explicit version of Burgess’ theorem valid for prime discrimin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. London Math. Society
دوره 91 شماره
صفحات -
تاریخ انتشار 2015